A Routing Technique for Query Scheduling and Forwarding in Unstructured Overlay Topology Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks

Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. They provide efficient and fault-tolerant routing, object location and load balancing within a selforganizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying...

متن کامل

Path Query Routing in Unstructured Peer-to-Peer Networks

In this article, we introduce a way to distribute an index database of XML documents on an unstructured peer-to-peer network with a flat topology (i.e. with no super-peer). We then show how to perform content path query routing in such networks. Nodes in the network maintain a set of Multi Level Bloom Filters that summarises structural properties of XML documents. They propagate part of this in...

متن کامل

Exploiting Query Feedback for Efficient Query Routing in Unstructured Peer-to-peer Networks

Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query rout...

متن کامل

Bi-filtered Forwarding: a Quasi-optimal Routing Algorithm for Query Delivery in Wireless Sensor Networks

A quasi-optimal query propagation algorithm Bi-Filtered Forwarding (BFF) for quickly routing a query throughout a wireless sensor network is proposed in this paper. BFF is implemented in a limited flooding manner for guaranteeing quick query propagation and low message consumption in wireless sensor networks. The experimental results show that in comparison with the flooding algorithm, BFF can ...

متن کامل

Query Routing using Query Feedback and Similarity in Unstructured Peer-to-peer Networks

In this paper, we propose a query based query routing approach for unstructured peer-to-peer network. We consider two parameters to be used to selectively route query in the network. The parameters are based on the recent past query and the similarity of the past query with the query to be routed. The objective of our approach is to have a low cost but effective routing approach in unstructured...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IJARCCE

سال: 2017

ISSN: 2278-1021

DOI: 10.17148/ijarcce.2017.6564